The Fish Feed Production Routing Problem

This paper introduces the fish feed production routing problem (FFPRP) faced by Norwegian salmon producers. The FFPRP is comprised of a scheduling and rich vehicle (VRP) thus denotes variant integrated problem. We present discrete time mixed integer programming (MIP) model FFPRP. Specifically, incorporates multi-product, multi-trip, multi-depot setting, where orders are produced at lines factories, delivered within their respective windows to customers heterogeneous fleet vessels. main objective minimize total costs, including costs not delivering orders. propose heuristic, combining decomposition adaptive large neighborhood search (ALNS) solve decomposition-based ALNS heuristic tested on number test instances which generated based vessel, factory, order data from two Norway’s largest For small instances, for commercial MIP solver often able prove optimality, average optimality gaps proposed relatively small, while larger significantly outperforms both in terms solution quality run time.